منابع مشابه
Strong Trinucleotide Circular Codes
1 Equipe de Bioinformatique Théorique, FDBT, LSIIT (UMR UdS-CNRS 7005), Université de Strasbourg, Pôle API, boulevard Sébastien Brant, 67400 Illkirch, France 2 Consiglio Nazionale delle Ricerche, Unità di Firenze, Dipartimento di Matematica “U.Dini”, Istituto di Analisi dei Sistemi ed Informatica “Antonio Ruberti”, viale Morgagni 67/A, 50134 Firenze, Italy 3 Université de Marne-la-Vallée, 5 bou...
متن کاملA classification of 20-trinucleotide circular codes
Article history: Received 20 April 2010 Revised 1 December 2011 Available online 28 December 2011
متن کاملIdentification of all trinucleotide circular codes
A new trinucleotide proposition is proved here and allows all the trinucleotide circular codes on the genetic alphabet to be identified (their numbers and their sets of words). This new class of genetic motifs, i.e. circular codes (or synchronizing genetic motifs), may be involved in the structure and the origin of the genetic code, and in reading frames of genes.
متن کاملA relation between trinucleotide comma-free codes and trinucleotide circular codes
The comma-free codes and circular codes are two important classes of codes in code theory and in genetics. Fifty years ago before the discovery of the genetic code, a trinucleotide (triletter) comma-free code was proposed for associating the codons of genes with the amino acids of proteins. More recently, in the last ten years, trinucleotide circular codes have been identified statistically in ...
متن کاملA hierarchy for circular codes
We first prove an extremal property of the infinite Fibonacci∗ word f : the family of the palindromic prefixes {hn | n ≥ 6} of f is not only a circular code but “almost” a comma-free one (see Prop. 12 in Sect. 4). We also extend to a more general situation the notion of a necklace introduced for the study of trinucleotides codes on the genetic alphabet, and we present a hierarchy relating two i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Combinatorics
سال: 2011
ISSN: 1687-9163,1687-9171
DOI: 10.1155/2011/659567